8 research outputs found
Quantum random walks with decoherent coins
The quantum random walk has been much studied recently, largely due to its
highly nonclassical behavior. In this paper, we study one possible route to
classical behavior for the discrete quantum walk on the line: the presence of
decoherence in the quantum ``coin'' which drives the walk. We find exact
analytical expressions for the time dependence of the first two moments of
position, and show that in the long-time limit the variance grows linearly with
time, unlike the unitary walk. We compare this to the results of direct
numerical simulation, and see how the form of the position distribution changes
from the unitary to the usual classical result as we increase the strength of
the decoherence.Comment: Minor revisions, especially in introduction. Published versio
Decoherence can be useful in quantum walks
We present a study of the effects of decoherence in the operation of a
discrete quantum walk on a line, cycle and hypercube. We find high sensitivity
to decoherence, increasing with the number of steps in the walk, as the
particle is becoming more delocalised with each step. However, the effect of a
small amount of decoherence is to enhance the properties of the quantum walk
that are desirable for the development of quantum algorithms. Specifically, we
observe a highly uniform distribution on the line, a very fast mixing time on
the cycle, and more reliable hitting times across the hypercube.Comment: (Imperial College London) 6 (+epsilon) pages, 6 embedded eps figures,
RevTex4. v2 minor changes to correct typos and refs, submitted version. v3
expanded into article format, extra figure, updated refs, Note on "glued
trees" adde
Quantum Walks driven by many coins
Quantum random walks have been much studied recently, largely due to their
highly nonclassical behavior. In this paper, we study one possible route to
classical behavior for the discrete quantum random walk on the line: the use of
multiple quantum ``coins'' in order to diminish the effects of interference
between paths. We find solutions to this system in terms of the single coin
random walk, and compare the asymptotic limit of these solutions to numerical
simulations. We find exact analytical expressions for the time-dependence of
the first two moments, and show that in the long time limit the ``quantum
mechanical'' behavior of the one-coin walk persists. We further show that this
is generic for a very broad class of possible walks, and that this behavior
disappears only in the limit of a new coin for every step of the walk.Comment: 36 pages RevTeX 4.0 + 5 figures (encapsulated Postscript). Submitted
to Physical Review
Simulation of quantum random walks using interference of classical field
We suggest a theoretical scheme for the simulation of quantum random walks on
a line using beam splitters, phase shifters and photodetectors. Our model
enables us to simulate a quantum random walk with use of the wave nature of
classical light fields. Furthermore, the proposed set-up allows the analysis of
the effects of decoherence. The transition from a pure mean photon-number
distribution to a classical one is studied varying the decoherence parameters.Comment: extensively revised version; title changed; to appear on Phys. Rev.
Quantum random walks in optical lattices
We propose an experimental realization of discrete quantum random walks using
neutral atoms trapped in optical lattices. The random walk is taking place in
position space and experimental implementation with present day technology
--even using existing set-ups-- seems feasible. We analyze the influence of
possible imperfections in the experiment and investigate the transition from a
quantum random walk to the classical random walk for increasing errors and
decoherence.Comment: 8 pages, 4 figure
Quantum quincunx in cavity quantum electrodynamics
Published versio
Experimental Implementation of the Quantum Random-Walk Algorithm
The quantum random walk is a possible approach to construct new quantum
algorithms. Several groups have investigated the quantum random walk and
experimental schemes were proposed. In this paper we present the experimental
implementation of the quantum random walk algorithm on a nuclear magnetic
resonance quantum computer. We observe that the quantum walk is in sharp
contrast to its classical counterpart. In particular, the properties of the
quantum walk strongly depends on the quantum entanglement.Comment: 5 pages, 4 figures, published versio
Quantum walks: a comprehensive review
Quantum walks, the quantum mechanical counterpart of classical random walks,
is an advanced tool for building quantum algorithms that has been recently
shown to constitute a universal model of quantum computation. Quantum walks is
now a solid field of research of quantum computation full of exciting open
problems for physicists, computer scientists, mathematicians and engineers.
In this paper we review theoretical advances on the foundations of both
discrete- and continuous-time quantum walks, together with the role that
randomness plays in quantum walks, the connections between the mathematical
models of coined discrete quantum walks and continuous quantum walks, the
quantumness of quantum walks, a summary of papers published on discrete quantum
walks and entanglement as well as a succinct review of experimental proposals
and realizations of discrete-time quantum walks. Furthermore, we have reviewed
several algorithms based on both discrete- and continuous-time quantum walks as
well as a most important result: the computational universality of both
continuous- and discrete- time quantum walks.Comment: Paper accepted for publication in Quantum Information Processing
Journa